Lipschitz bijections between boolean functions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Lipschitz Bijections between Boolean Functions

Given two functions f, g : {0, 1}n → {0, 1} a mapping ψ : {0, 1}n → {0, 1}n is said to be a mapping from f to g if it is a bijection and f(z) = g(ψ(z)) for every z ∈ {0, 1}n. In this paper we study Lipschitz mappings between boolean functions. Our first result gives a construction of a C-Lipschitz mapping from the Majority function to the Dictator function for some universal constant C. On the ...

متن کامل

On Efficient Bijections between Permutations and Functions

We explore efficient surjections and bijections between sets of functions and sets of permutations. These mappings are efficient in the sense that with only a few evaluations (polynomial in the size of inputs) of a black box representing either a function or permutation, we can evaluate the corresponding permutation or function for a particular input. It is not obvious that such efficient surje...

متن کامل

Two Bijections between G-parking Functions and Spanning Trees

For a directed graph G on vertices {0, 1, . . . , n}, a G-parking function is an n-tuple (b1, . . . , bn) of non-negative integers such that, for every non-empty subset U ⊆ {1, . . . , n}, there exists a vertex j ∈ U for which there are more than bj edges going from j to G − U . We construct two bijective maps between the set PG of Gparking functions and the set TG of spanning trees of G rooted...

متن کامل

On Bijections vs. Unary Functions

A set of nite structures is in Binary NP if it can be characterized by existential second order formulas in which second order quan-tiication is over relations of arity 2. In DLS95] subclasses of Binary NP were considered, in which the second order quantiiers range only over certain classes of relations. It was shown that many of these subclasses coincide and that all of them can be ordered in ...

متن کامل

Matroidal bijections between graphs

We study a hierarchy of five classes of bijections between the edge sets of two graphs: weak maps, strong maps, cyclic maps, orientable cyclic maps, and chromatic maps. Each of these classes contains the next one and is a natural class of mappings for some family of matroids. For example, f: E(G) --t E(H) is cyclic if every cycle (eulerian subgraph) of G is mapped onto a cycle of H. This class ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorics, Probability and Computing

سال: 2020

ISSN: 0963-5483,1469-2163

DOI: 10.1017/s0963548320000541